package UnitTest.AlgorithmTest.backtrackTest;

import Algorithm.backtrack.ArrayPermutation;
import TestData.DataStructureTestData.stringANDlineTestData.slidingWindowTestData.SlidingWindowTestData;
import org.junit.Test;

import java.util.List;

/**
 * @author liujun
 * @version 1.0
 * @date 2021/1/19
 * @author—Email liujunfirst@outlook.com
 * @blogURL https://blog.csdn.net/ljfirst
 * @description 数组的连续积小于给定值的组合 测试案例
 */
public class ArrayPermutationTest extends SlidingWindowTestData {

    ArrayPermutation arrayPermutation = new ArrayPermutation();

    @Test
    public void test() {

        List<List<Integer>> list_all = arrayPermutation.getAnswer(demo01, target01);
        for (int i = 0; i < list_all.size(); i++) {
            List list = list_all.get(i);
            int[] answer01_sub = answer01[i];
            for (int j = 0; j < list.size(); j++) {
                assert answer01_sub[j] == (int) list.get(j);
            }
        }
        

      /*  list_all = arrayPermutation.getAnswer(demo02, target02);
        for (int i = 0; i < list_all.size(); i++) {
            List list = list_all.get(i);
            int[] answer01_sub = answer02[i];
            for (int j = 0; j < list.size(); j++) {
                assert answer01_sub[j] == (int) list.get(j);
            }
        }*/

    }
}
